On subgraphs of Cartesian product graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On subgraphs of Cartesian product graphs

Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K2,3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.

متن کامل

Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs

The vertices of the flag graph Φ(P ) of a graded poset P are its maximal chains. Two vertices are adjacent whenever two maximal chains differ in exactly one element. In this paper we characterize induced subgraphs of Cartesian product graphs and flag graphs of graded posets. The latter class of graphs lies between isometric and induced subgraphs of Cartesian products in the embedding structure ...

متن کامل

On subgraphs of Cartesian product graphs and S-primeness

In this paper we consider S-prime graphs, that is the graphs that cannot be represented as nontrivial subgraphs of nontrivial Cartesian products of graphs. Lamprey and Barnes characterized S-prime graphs via so-called basic S-prime graphs that form a subclass of all S-prime graphs. However, the structure of basic S-prime graphs was not known very well. In this paper we prove several characteriz...

متن کامل

Secret Sharing Based On Cartesian product Of Graphs

The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...

متن کامل

The reliability Wiener number of cartesian product graphs

Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2002

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(01)00085-1